Who Wins Domineering on Rectangular Boards?

نویسندگان

  • Michael Lachmann
  • Cristopher Moore
  • Ivan Rapaport
چکیده

Using mostly elementary considerations, we find out who wins the game of Domineering on all rectangular boards of width 2, 3, 5, and 7. We obtain bounds on other boards as well, and prove the existence of polynomial-time strategies for playing on all boards of width 2, 3, 4, 5, 7, 9, and 11. We also comment briefly on toroidal and cylindrical boards.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

11 x 11 Domineering is Solved: The first player wins

We have developed a program called MUDoS (Maastricht University Domineering Solver) that solves Domineering positions in a very efficient way. This enables the solution of known positions so far (up to the 10 × 10 board) much quicker (measured in number of investigated nodes). More importantly, it enables the solution of the 11 × 11 Domineering board, a board up till now far out of reach of pre...

متن کامل

An update on domineering on rectangular boards

Domineering is a combinatorial game played on a subset of a rectangular grid between two players. Each board position can be put into one of four outcome classes based on who the winner will be if both players play optimally. In this note, we review previous work, establish the outcome classes for several dimensions of rectangular board, and restrict the outcome class in several more.

متن کامل

Perfectly Solving Domineering Boards

In this paper we describe the perfect solving of rectangular empty Domineering boards. Perfect solving is defined as solving without any search. This is done solely based on the number of various move types in the initial position. For this purpose we first characterize several such move types. Next we define 12 knowledge rules, of increasing complexity. Of these rules, 6 can be used to show th...

متن کامل

Tromping Games: Tiling with Trominoes

The game of Domineering is a combinatorial game that has been solved for several boards, including the standard 8 × 8 board. We create new partizan – and some impartial – combinatorial games by using trominos instead of and along with dominoes. We analyze these Tromping games for some small boards providing a dictionary of values. Further, we prove properties that permit expressing some connect...

متن کامل

Project Ideas

I am happy to supervise projects in any area of combinatorics or algebra. This document gives some possible subjects. Most could be adapted to be suitable as either a 3rd year, 4th year or MSc project. Combinatorial game theory. In the game of Domineering the two players are called Horizontal and Vertical. In each turn, Vertical places a domino vertically on the board, and then Horizontal place...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2000